Description: C#中实现最短路，该图算法描述的是这样的场景：图由节点和带有方向的边构成，每条边都有相应的权值，路径规划（最短路径）算法就是要找出从节点A到节点B的累积权值最小的路径。-achieve the most short-circuit, the algorithm described in the plan that is the scene : map with nodes and from the direction of the edges, and each side has a corresponding weights, Path Planning (Shortest Path) algorithm is to identify from the node A to node B, the cumulative value of the minimum right path. Platform: |
Size: 3072 |
Author:1 |
Hits:
Description: 基于VC++的路径规划，主要实现了基于对话框的路径规划界面应用程序。-Based on VC++ Path planning, the main dialog box based on the interface of the path planning application. Platform: |
Size: 80896 |
Author:liuyaqiong |
Hits:
Description: 利用Dijkstra算法来求网络图的最短路径，找到从起点P1到终点Pn的最短路径，由于上述算法使用了连接线中点的条件，不是整个规划空间的最优路径，然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整，让各路径点在相应障碍物端点连线上滑动-Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide Platform: |
Size: 9216 |
Author:jack |
Hits:
Description: 這是有關於路徑規劃的演算法，也是路徑規劃裡面較為基本的一個演算法，可以計算出路徑最短的路線，但是當地圖的深度越來越大時，會使得這個演算法耗費較多的電腦運算資源，因為會把地圖每一點都進行運算進而產生出最短的路徑。-This is on the path planning algorithm, but also more basic path planning inside an algorithm that can calculate the shortest path route, but increasing the depth of the map, it will make this algorithm takes more computer computing resources, because each point will map for computing the shortest path and produce. Platform: |
Size: 183296 |
Author:victor shih |
Hits:
Description: 路径搜索程序，适用于路径规划，这是我自己编写的一个小程序，大家请多指教-Route search program for path planning, which I have written a small program, you please enlighten Platform: |
Size: 3072 |
Author:yuandeyu |
Hits:
Description: ：在栅格中使用经典的Dijkstra 算法进行路径规划有计算量大、规划时间长、进行扩展判断的节点个数多等缺点-: Using the grid classical Dijkstra algorithm path planning have large computation, planning for a long time, determine the number of nodes expanded more disadvantages Platform: |
Size: 177152 |
Author:刘同学 |
Hits:
Description: This a program for 3D path planning using dijkstra algorithm. The map, start point and the goal point are defined by the user and the algorithm calculates a safe path between the start point and goal point without any collisions. Finally a trajectory is developed between both the points. -This is a program for 3D path planning using dijkstra algorithm. The map, start point and the goal point are defined by the user and the algorithm calculates a safe path between the start point and goal point without any collisions. Finally a trajectory is developed between both the points. Platform: |
Size: 215040 |
Author:Prashant |
Hits:
Description: Dijkstra算法，解决机器人的路径规划问题，使用的程序语言为matlab语言。(This is the Dijkstra algorithm. It can solve the robot path planning problem, and the result is good. The programming language used is the MATLAB language.) Platform: |
Size: 2048 |
Author:小小朱朱
|
Hits:
Description: 此程序实现从起点到终点的路径规划算法，注释详细，本人已测试(This procedure to achieve from the beginning to the end of the path planning algorithm, detailed comments, I have tested) Platform: |
Size: 1857536 |
Author:Davedli
|
Hits:
Description: Dijkstra航迹规划算法程序，有一定的缺点，就是路径长度相同时，只能规划处一条航迹。(Dijkstra path planning algorithm program, there are some disadvantages, that is, when the path length is the same, can only plan a track.) Platform: |
Size: 1024 |
Author:青云a
|
Hits:
Description: 应用于路径规划的dijkstra算法，可找到最优路径，但运算速度较慢(The Dijkstra algorithm used in path planning can find the optimal path, but the operation speed is slow) Platform: |
Size: 1382400 |
Author:llllsb |
Hits:
Search - path planning dijkstra